Solving Open Job-Shop Scheduling Problems by SAT Encoding
نویسندگان
چکیده
منابع مشابه
Solving Job-Shop Scheduling Problems by Genetic Algorithm
Job-shop Scheduling Problem (JSP) is one of extremely hard problems because it requires very large combinatorial search space and the precedence constraint between machines. The traditional algorithm used to solve the problem is the branch-andbound method, which takes considerable computing time when the size of problem is large. W e propose a new method for solving JSP using Genetic Algorithm ...
متن کاملSolving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer
In real-world manufacturing environments, it is common to face a job-shop scheduling problem (JSP) with uncertainty. Among different sources of uncertainty, processing times uncertainty is the most common. In this paper, we investigate the use of a multiobjective genetic algorithm to address JSPs with uncertain durations. Uncertain durations in a JSP are expressed by means of triangular fuzzy n...
متن کاملHeuristic Methods for Solving Job-Shop Scheduling Problems
Solving scheduling problems with Constraint Satisfaction Problems (CSP’s) techniques implies a wide space search with a large number of variables, each one of them with a wide interpretation domain. This paper discusses the application of CSP heuristic techniques (based on the concept of slack of activities) for variable and value ordering on a special type of job-shop scheduling problems in wh...
متن کاملA hybrid method for solving stochastic job shop scheduling problems
This paper presents a nonlinear mathematical programming model for a stochastic job shop scheduling problem. Due to the complexity of the proposed model, traditional algorithms have low capability in producing a feasible solution. Therefore, a hybrid method is proposed to obtain a near-optimal solution within a reasonable amount of time. This method uses a neural network approach to generate in...
متن کاملMemetic algorithms for solving job-shop scheduling problems
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. In this paper, we developed a memetic algorithm (MA) for solving JSSPs. Three priority rules were designed, namely partial re-ordering, gap reduction and restricted swapping, and used as local sea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.2316